Upper Bounds in Classical Discrepancy Theory
نویسندگان
چکیده
We discuss some of the ideas behind the study of upper bound questions in classical discrepancy theory. The many ideas involved come from diverse areas of mathematics and include diophantine approximation, probability theory, number theory and various forms of Fourier analysis. We illustrate these ideas by largely restricting our discussion to two dimensions.
منابع مشابه
The Inverse of the Star-discrepancy Depends Linearly on the Dimension
We study bounds on the classical ∗-discrepancy and on its inverse. Let n∞(d, ε) be the inverse of the ∗-discrepancy, i.e., the minimal number of points in dimension d with the ∗-discrepancy at most ε. We prove that n∞(d, ε) depends linearly on d and at most quadratically on ε−1. We present three upper bounds on n∞(d, ε), all of them are based on probabilistic arguments and therefore they are no...
متن کاملThe probabilistic method for upper bounds in domination theory
Domination is a rapidly developing area of research in graph theory, and its various applications to ad hoc networks, distributed computing, social networks and web graphs partly explain the increased interest. This thesis focuses on domination theory, and the main aim of the study is to apply a probabilistic approach to obtain new upper bounds for various domination parameters. Chapters 2 and ...
متن کاملCombinatorial Discrepancy for Boxes via the γ2 Norm
The γ2 norm of a realm×n matrix A is the minimum number t such that the column vectors of A are contained in a 0-centered ellipsoid E ⊆ R that in turn is contained in the hypercube [−t, t]. This classical quantity is polynomial-time computable and was proved by the second author and Talwar to approximate the hereditary discrepancy herdiscA as follows: γ2(A)/O(logm) ≤ herdiscA ≤ γ2(A) · O( √ log...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملBracketing numbers for axis-parallel boxes and applications to geometric discrepancy
In the first part of this paper we derive lower bounds and constructive upper bounds for the bracketing numbers of anchored and unanchored axis-parallel boxes in the d-dimensional unit cube. In the second part we apply these results to geometric discrepancy. We derive upper bounds for the inverse of the star and the extreme discrepancy with explicitly given small constants and an optimal depend...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012